Hierarchical routing in traffic networks
نویسندگان
چکیده
In this paper the design of a dynamic Routing system, called Hierarchical routing system, has been developed. It splits traffic networks into several smaller and less complex networks by introducing a hierarchy. The Hierarchical routing system therefore consists of several distributed Routing systems where each of it is responsible for one network of the hierarchical network. The route optimization is done with an adapted version of the AntNet-algorithm, a decentralized routing algorithm, which uses intelligent agents that explore the network and find the shortest routes in time. This algorithm was derived from the behaviour of ants in nature.
منابع مشابه
MLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....
متن کاملRouting Improvement for Vehicular Ad Hoc Networks (VANETs) Using Nature Inspired Algorithms
are a subset of MANETs in which vehicles are considered as network clients. These networks have been created to communicate between vehicles and traffic control on the roads. have similar features to MANETs and their main special property is the high-speed node mobility which makes a quick change of the network. The rapid change of network topology is a major challenge in routing. One of the we...
متن کاملA fault tolerance routing protocol considering defined reliability and energy consumption in wireless sensor networks
In wireless sensor networks, optimal consumptionof energy and having maximum life time are important factors. In this article attempt has been made to send the data packets with particular reliability from the beginning based on AODV protocol. In this way two new fields add to the routing packets and during routing and discovering of new routes, the lowest remained energy of nodes and route tra...
متن کاملComparative Performance Analysis of AODV,DSR, TORA and OLSR Routing Protocols in MANET Using OPNET
Mobile Ad Hoc Networks (MANETs) are receiving a significant interest and are becoming very popular in the world of wireless networks and telecommunication. MANETs consist of mobile nodes which can communicate with each other without any infrastructure or centralized administration. In MANETs, the movement of nodes is unpredictable and complex; thus making the routing of the packets challenging....
متن کاملLocal clustering for hierarchical ad hoc networks
Hierarchical, cluster-based routing greatly reduces routing table sizes compared to host-based routing and the amount of routing related signalling traffic, while reducing path efficiency [8] and generating some management traffic [5], [10], [13]. Proposals for and analysis of cluster-based routing in dynamic networks include [9] and [13]. We present a local clustering method that requires no e...
متن کامل